#include <bits/stdc++.h>
using namespace std;

// #define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T>
using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x)&(-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz size()

void solve () {
    int n;
    string s;
    cin >> n >> s;
    int len = s.sz;
    s = '0' + s;

    int tot = (1 << n) - 1;
    unordered_map<int, int>vis;

    bool f = false;

    function<void (int)>dfs = [&] (int u) {
        if (f || vis[u]) {
            RE;
        }
        vis[u] = 1;
        if (u > 0 && s[u] == '1') {
            RE;
        }
        if (!u) {
            f = 1;
            Yes;
            RE;
        }

        FOR (k, 0, n - 1) {
            int t = (1 << k);
            if ((u >> k) & 1) {
                dfs (u ^ t);
                if (f)RE;
            }
        }
        };

    dfs (tot);
    if (!f) {
        No;
    }

}

signed main () {
    int Task = 1;

    ios::sync_with_stdio (false);
    cin.tie (nullptr);
    cin >> Task;

    while (Task--) {
        solve ();
    }

    return 0;
}